Characterizing Truthful Market Design
نویسندگان
چکیده
This paper characterizes the family of truthful double-sided auctions. Despite the importance of double-sidedauctions to market design, to date no characterizationof truthful double-sided auctions was made. This pa-per characterizes truthful mechanisms for double-sidedauctions by generalizing Roberts classic result [29], toshow that truthful double-sided auctions must ”almost”be affine maximizers.Our main result of characterizing double-sided auc-tions required the creation of a new set of tools, reduc-tions that preserve economic properties. This paperutilizes two such reductions; a truth-preserving reduc-tion and a non-affine preserving reduction. The truth-preserving reduction is used to reduce the double-sidedauction to a special case of a combinatorial auction tomake use of the impossibility result proved in [20]. Intu-itively, our proof shows that truthful double-sided auc-tions are as hard to design as truthful combinatorialauctions.Two important concepts are developed in additionto the main result. First, the form of reduction usedin this paper is of independent interest as it providesa means for comparing mechanism design problems bydesign difficulty. Second, we define the notion of ex-tension of payments; which given a set of payments forsome players finds payments for the remaining play-ers. The extension payments maintain the truthful andaffine maximization properties.
منابع مشابه
Characterizing Optimal Syndicated Sponsored Search Market Design
The analysis to date of sponsored search auctions, originally conducted by Varian and independently by Aggarwal et al., has yet to describe more recent developments such as the emergence of interacting advertising exchanges. This paper assess the significance of such phenomena. Building on Gonen and Vassilvitskii’s model of sponsored search with reserve prices we depict advertising networks as ...
متن کاملTruth, Envy, and Truthful Market Clearing Bundle Pricing
We give a non-trivial class of valuation functions for which we give auctions that are efficient, truthful and envy-free. We give interesting classes of valuations for which one can design such auctions. Surprisingly, we also show that minor modifications to these valuations lead to impossibility results, the most surprising of which is that for a natural class of valuations, one cannot achieve...
متن کاملOn incentive issues in practical auction design
Algorithmic mechanism design studies the allocation of resources to selfish agents, who might behave strategically to maximize their own utilities. This thesis studies these incentive issues arsing from four different settings, that are motivated by reallife applications. We model the settings and problems by appropriately extending or generalizing classical economic models. After that we syste...
متن کاملTruthful Double Auction Mechanisms
Following the multistage design approach, we propose two asymptotically efficient truthful double auction mechanisms, the BC-LP mechanism and the MBC mechanism, for an exchange market with many buyers and sellers. In this market, each buyer wants to procure a bundle of commodities and each seller supplies one unit of a commodity. Furthermore, various transaction-related costs will be incurred w...
متن کاملTruthful Bundle/Multiunit Double Auctions
W address the mechanism design problem for a market with multiple buyers and sellers. Each buyer demands some bundle(s) of various commodities, and each seller supplies multiple units of one commodity. To design truthful double-auction mechanisms, we propose a novel “padding” method that intentionally creates imbalances between the supply availability and demand requirement by introducing a pha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007